Starvation-Prevented Priority-Based Total Ordering Broadcast Protocol on High-Speed Single Channel Network

In distributed applications like teleconferencing, various kinds of data like transactions, les, and voice have to be delivered to multiple destinations. Current high-speed networks like the FDDI provide highreliable broadcast communication. However, since the processing speed of the communication entities is slower than the transmission speed of the network, the entities may fail to receive protocol data units (PDUs) transmitted through the network due to the bu er overrun. Some data units like control data have to be delivered to the destinations earlier than another PDUs. One approach to providing various kinds of communication by using a single-channel network is to give a priority to each PDU and to deliver higher-priority PDUs to the destinations earlier than lower-priority ones. In this paper, we discuss a distributed broadcast protocol which provides priority-based receipt ordering of PDUs for the application entities by using the highspeed single-channel network in the presence of the loss of the PDUs. there is a starvation problem, i.e. lower-priority PDUs can be left waiting inde nitely in the receipt queue since higher-priority PDUs jump over lower-priority ones. In this paper, we present a method by which even lower-priority PDUs are delivered to the application entities in some pre-de ned time by partitioning the receipt sequence of PDUs into runs, where each run is priority-based ordered.